搜索资源列表
zuiduanlujing
- 优化了之前的那个版本，最短路径用Dijkstra算法实现的MFC编程，这次是按实际的路径来将路画出来了。-That before the optimized version of Dijkstra shortest path algorithm using the MFC programming, this is the actual path to the road drawn out.
shortestpath
- 最短路径用Dijkstra算法实现的MFC编程，用画笔将路径描绘出来-Dijkstra shortest path algorithm using the MFC programming, with the brush to the path described by the
DIJSHOW
- MFC实现Dijkstra算法，手动添加点和线-Dijkstra
TrafficCommand
- 建立交通网络图的存储结构 解决单源最短路径问题(Dijkstra算法) 实现两个城市之间的最短路径的问题 用MFC实现可视化菜单界面，使操作更加人性化，包括启动界面、图标、背景、按钮、界面框架等设计-Established transportation network graph structure to solve the storage problem of single-source shortest path (Dijkstra algorithm) to achieve t
searchpath
- 模拟的公交车查询，是学生自己写的，比较简单，其中有a*算法和迪杰斯特拉算法的简单应用。适合练习使用mfc-Analog bus query students to write their own, relatively simple, where there is a* simple application of the algorithm and Dijkstra algorithm. Suitable for practice use mfc
short
- C语言最短路径 迪杰斯特拉算法MFC VC-Dijkstra shortest path MFC VC++
shortestpath
- 迪杰斯特拉算法最短路径，基于vc++mfc平台开发，可供数据结构编程参考-Dijkstra shortest path algorithm, based on vc++mfc platform
map
- VC6.0写的以迪杰斯特拉算法为原理的地图程序。以MFC为基础实现了图形化的显示。-VC6.0 write to Dijkstra algorithm principle mapping application. In MFC-based realization of a graphical display.